On tape-bounded probabilistic Turing machine acceptors
نویسندگان
چکیده
منابع مشابه
Tape-Reversal Bounded Turing Machine Computations
This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape-reversal limited complexity classes and their properties and ordering are investigated. The most striking difference between this and the previously studied complexity measures ...
متن کاملOne-Tape, Off-Line Turing Machine Computations
In this paper we shall consider Turing machines tha t can, at any given step in their computations, do each of the following things: (a) change the tape symbols currently scanned by their reading heads, (b) shift each of their tapes one square to the left or right, (c) change their internal state, and (d) halt. Each step is assumed to require exactly one t ime unit for its completion. I n order...
متن کاملOn the Algebraic Representation of One-Tape Deterministic Turing Machine
An algebraic representation of the Turing machines is given, where the configurations of Turing machines are represented by 4 order tensors, and the transition functions by 8 order tensors. Two types of tensor product are defined, one is to model the evolution of the Turing machines, and the other is to model the compositions of transition functions. It is shown that the two types of tensor pro...
متن کاملA Foundation of Programming a Multi-tape Quantum Turing Machine
The notion of quantum Turing machines is a basis of quantum complexity theory. We discuss a general model of multi-tape, multihead Quantum Turing machines with multi final states that also allow tape heads to stay still.
متن کاملNew Lower Bounds for Element Distinctness on a On-Tape Turing Machine
It is shown that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a one-tape Turing machine takes time proportional to almost the square of the size of the input. The proof holds for both deterministic and nondeterministic Turing machines. This proof improves the best known lower bound of (n 2 = log n) for deterministic Turing machines and of (n log 2 n) 4] for nondeter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1981
ISSN: 0304-3975
DOI: 10.1016/0304-3975(81)90032-3